Claw-free graphs - A survey
نویسندگان
چکیده
In this paper we summarize known results on claw-free graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraphs e) Invariants f) Squares g) Regular graphs h) Other hamiltonicity related results and generalizations 3. Matchings and factors 4. Independence, domination, other invariants and extremal problems 5. Algorithmic aspects 6. Miscellaneous 7. Appendix-List of all 2-connected nonhamiltonian claw-free graphs on n 12 vertices.
منابع مشابه
On some intriguing problems in hamiltonian graph theory--a survey
We survey results and open problems in hamiltonian graph theory centred around three themes: regular graphs, t-tough graphs, and claw-free graphs.
متن کاملVizing's conjecture: a survey and recent results
Vizing’s conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results along the way. For instance, several new properties of a minimal counterexample to the conjecture are obtained an...
متن کاملHow Many Conjectures Can You Stand? A Survey
Wesurvey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to awealth of interesting concepts, techniques, results and equivalent conjectures.
متن کاملThe Structure of Claw-Free Perfect Graphs
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed [6] successfully described how elementary graphs can be built using line-graphs of bipartite graphs using local augmentation. How...
متن کاملApproximating independence polynomials of claw-free graphs
Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 164 شماره
صفحات -
تاریخ انتشار 1997